Timetabling and Scheduling Problems

Scheduling Agents - Distributed Timetabling Problems(DisTTP)

Many real world Timetabling Problems (TTPs) are composed of organizational parts that need to timetable their staff in an independent way, while adhering to some global constraints. Later the departmental timetables are combined to yield a coherent, consistent solution. This last phase involves negotiations with the various agents and requests for changes in their own

The Design of Memetic Algorithms for Scheduling and Timetabling Problems

There are several characteristics that make scheduling and timetabling problems particularly difficult to solve: they have huge search spaces, they are often highly constrained, they require sophisticated solution representation schemes, and they usually require very time-consuming fitness evaluation routines. There is a considerable number of memetic algorithms that have been proposed in the l...

Agents in Timetabling Problems

Memetic Algorithms in Planning, Scheduling, and Timetabling

Memetic algorithms (MAs) constitute a metaheuristic optimization paradigm based on the systematic exploitation of knowledge about the problem being solved, and the synergistic combination of ideas taken from other population-based and trajectory-based metaheuristics. They have been successfully deployed on a plethora of hard combinatorial optimization problems, amongst which scheduling, plannin...

Transit Network Re-timetabling and Vehicle Scheduling

In the transit planning literature, network timetabling and vehicle scheduling are usually treated in a sequential manner. In this paper, we focus on combining important features of these two steps, and underline how their simultaneous optimization is meaningful and can bring important improvements to both quality of service and level of resources required. We deal with the objectives of networ...